Polynomials over Finite Fields and Applications
نویسندگان
چکیده
Self-reciprocal irreducible monic (srim) polynomials over finite fields have been studied in the past. These polynomials can be studied in the context of quadratic transformation of irreducible polynomials over finite fields. In this talk we present the generalization of some of the results known about srim polynomials to polynomials obtained by quadratic transformation of irreducible polynomials over finite fields. Speaker: Dan Bernstein (University of Illinois at Chicago) Title: Faster factorization into coprimes Abstract: How quickly can we factor a set of univariate polynomials into coprimes? See http://cr.yp.to/coprimes.html for examples and applications. Bach, Driscoll, and Shallit achieved time n in 1990, where n is the number of input coefficients; I achieved time n(lg n) in 1995; much more recently I achieved time n(lgn). Speaker: Antonia Bluher (National Security Agency) Title: Hyperquadratic elements of degree 4 Abstract: I will describe joint work with Alain Lasjaunias about the construction of degree-4 polynomials over fields K of char p whose roots α have a Frobenius property:
منابع مشابه
Reversed Dickson polynomials over finite fields
Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x, a) over finite fields by reversing the roles of the indeterminate x and the parameter a. We study reversed Dickson polynomials with emphasis on their permutational properties over finite fields. We show that reversed Dickson permutation polynomials (RDPPs) are closely related to almost perfect nonlinear ...
متن کاملGeneralized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields
We give new descriptions of the factors of Dickson polynomials over finite fields in terms of cyclotomic factors. To do this generalized reciprocal polynomials are introduced and characterized. We also study the factorization of generalized cyclotomic polynomials and their relationship to the factorization of Dickson polynomials.
متن کاملFactors of Dickson polynomials over finite fields
We give new descriptions of the factors of Dickson polynomials over finite fields.
متن کاملParity of the number of irreducible factors for composite polynomials
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The ...
متن کاملSpecific permutation polynomials over finite fields
We present new classes of permutation polynomials over finite fields. If q is the order of a finite field, some polynomials are of form xrf(x(q−1)/d), where d|(q − 1). Other permutation polynomials are related with the trace function. 2000 Mathematics Subject Classification: Primary 11T06.
متن کاملFactoring polynomials over Z4 and over certain Galois rings
It is known that univariate polynomials over finite local rings factor uniquely into primary pairwise coprime factors. Primary polynomials are not necessarily irreducible. Here we describe a factorisation into irreducible factors for primary polynomials over Z4 and more generally over Galois rings of characteristic p. An algorithm is also given. As an application, we factor x − 1 and x + 1 over...
متن کامل